PTA: Finding Hard-to-Find Data Plane Bugs
نویسندگان
چکیده
Bugs in network hardware can cause tremendous problems. However, programmable devices have the potential to provide greater visibility into internal behavior of devices, allowing us more quickly find and identify In this paper, we a taxonomy data plane bugs, use derive Portable Test Architecture (PTA) which offers essential abstractions for testing on variety devices. PTA is implemented with novel design that (i) separates target-specific from target-independent components, portability, (ii) allows users write test program once at compile time, but dynamically alter via runtime configuration. We report 12 diverse bugs different targets, their associated software, exposed using PTA.
منابع مشابه
Experiences Using Static Analysis to Find Bugs
Static analysis examines code in the absence of input data and without running the code, and can detect potential security violations (e.g., SQL injection), runtime errors (e.g., dereferencing a null pointer) and logical inconsistencies (e.g., a conditional test that cannot possibly be true). While there is a rich body of literature on algorithms and analytical frameworks used by such tools, re...
متن کاملExtending Mutation Testing to Find Environmental Bugs
Environmental bugs are bugs caused by limitations of precision or capacity in the environment of a piece of software. These bugs may be difficult to activate and even more difficult to find. This paper reports on an extension to traditional mutation testing that enables testing specifically for environmental bugs involving integer arithmetic. This method is both simple and effective, and provid...
متن کاملSix ways to automatically find software bugs
With the rapid development of hardware and the emerging of smart devices like smart phones and wearable gadgets, software, the soul of those devices, becomes more and more important. However, program bugs, which often cause system failure and misbehaviors, is one of the most severe stumbling blocks for even further development of those technologies. Since automatically detecting all bugs in a p...
متن کاملHard Sets are Hard to Find
We investigate the frequency of complete sets for various complexity classes within EXP under several polynomial-time reductions in the sense of resource bounded measure. We show that these sets are scarce: The sets that are complete under 6 p n ?tt-reductions for NP, the levels of the polynomial-time hierarchy, and PSPACE have p 2-measure zero for any constant < 1. The 6 p n c ?T-complete sets...
متن کاملA Machine Learning Approach to Finding Bugs
Recently a number of tools have been developed for finding bugs in programs without executing the programs. While these tools are helpful, they often report too many false alarms, false negatives or both. This paper does not present any new such tools. Rather, it is focused on providing a machine learning approach for integrating existing bug finding tools into a practical and adaptive toolset.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE ACM Transactions on Networking
سال: 2023
ISSN: ['1063-6692', '1558-2566']
DOI: https://doi.org/10.1109/tnet.2022.3214062